Online (J, K)-search problem and its competitive analysis
نویسندگان
چکیده
Article history: Received 5 April 2015 Received in revised form 30 May 2015 Accepted 2 June 2015 Available online 9 June 2015 Communicated by D.-Z. Du
منابع مشابه
Optimal online algorithms for the multi-objective time series search problem
Abstract: Tiedemann, et al. [Proc. of WALCOM, LNCS 8973, 2015, pp.210-221] defined multiobjective online problems and the competitive analysis for multi-objective online problems and showed that (1) with respect to the worst component competitive analysis, the online algorithm reservation price policy rpp-high is best possible for the multi-objective time series search problem; (2) with respect...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملClosed Formulas of the Arithmetic Mean Component Competitive Ratio for the 3-Objective and 4-Objective Time Series Search Problems
For the multi-objective time series search problem, Hasegawa and Itoh [Proc. of WALCOM, LNCS 9627, 2016, pp.201-212] presented the best possible online algorithm balanced price policy bpp for any monotone function f : R → R and derived the exact values of the competitive ratio for several monotone functions. Specifically for the monotone function f(c1, . . . , ck) = (c1, . . . , ck)/k, Hasegawa...
متن کاملA o(n) -Competitive Deterministic Algorithm for Online Matching on a Line
Online matching on a line involves matching an online stream of items of various sizes to stored items of various sizes, with the objective of minimizing the average discrepancy in size between matched items. The best previously known upper and lower bounds on the optimal deterministic competitive ratio are linear in the number of items, and constant, respectively. We show that online matching ...
متن کاملGeometric On-line Ray Searching Under Probability of Placement Scenarios
Online computation is a model for formulating decision making under uncertainty. In an online problem, the algorithm does not know the entire input from the beginning; the input is revealed in a sequence of steps. At each step, the algorithm should make its decisions based on the past and without any knowledge about the future. Many important real-life problems such as robot navigation are intr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 593 شماره
صفحات -
تاریخ انتشار 2015